Partial Order Reduction in Symbolic State Space Traversal Using ZBDDs
نویسندگان
چکیده
In order to reduce state explosion problem, techniques such as symbolic state space traversal and partial order reduction have been proposed. Combining these two techniques, however, seems difficult, and only a few research projects related to this topic have been reported. In this paper, we propose handling single place zero reachability problem of Petri nets by using both partial order reduction and symbolic state space traversal based on ZBDDs. We also show experimental results of several examples. key words: symbolic analysis, partial order reduction, Petri net, single place zero reachability problem
منابع مشابه
Cav 1997 Submission: Category a Partial Order Reduction in Symbolic State Space Exploration
State space explosion is a fundamental obstacle in formal veriication of designs and protocols. Several techniques for combating this problem have emerged in the past few years, among which two are signiicant: symbolic state space search using BDDs and partial order reductions. In asynchronous systems, interleavings of independent concurrent events are equivalent, and only a representative inte...
متن کاملHybrid Analysis for Partial Order Reduction of Programs with Arrays
An important component of efficient approaches to software model checking and systematic concurrency testing is partial order reduction, which eliminates redundant non-deterministic thread scheduling choices during the state space traversal. Thread choices have to be created only at the execution of actions that access the global state visible by multiple threads, so the key challenge is to pre...
متن کاملPartial-Order Reduction in Symbolic State Space Exploration
State space explosion is a fundamental obstacle in formal veri cation of designs and protocols. Several techniques for combating this problem have emerged in the past few years, among which two are signi cant: partialorder reductions and symbolic state space search. In asynchronous systems, interleavings of independent concurrent events are equivalent, and only a representative interleaving nee...
متن کاملMonotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration for model checking concurrent software. Our technique hinges on a new characterization of partial orders defined by computations of a concurrent program in terms of quasi-monotonic sequences of thread-ids. This characterizatio...
متن کاملCombining Partial Order Reduction with Bounded Model Checking
Model checking is an efficient technique for verifying properties on reactive systems. Partial-order reduction (POR) and symbolic model checking are two common approaches to deal with the state space explosion problem in model checking. Traditionally, symbolic model checking uses BDDs which can suffer from space blowup. More recently bounded model checking (BMC) using SAT-based procedures has b...
متن کامل